The Shift-Match Number and String Matching Probabilities for Binary Sequences
نویسندگان
چکیده
Abstract We define the “shift-match number” for a binary string and we compute the probability of occurrence of a given string as a subsequence in longer strings in terms of its shift-match number. We thus prove that the string matching probabilities depend not only on the length of shorter strings, but also on the equivalence class of the shorter string determined by its shift-match number. PACS 02.10.Ox, 87.10.+e
منابع مشابه
Digital Binary Phase-shift Keyed Signal Detector
We have developed the effective algorithm for detecting digital binary phase-shift keyed signals. This algorithm requires a small number of arithmetic operations over the signal period. It can be relatively easy implemented based on the modern programmable logic devices. It also provides high interference immunity by identifying signal presence when signal-to-noise ratio is much less that its w...
متن کاملA New Efficient Hybrid Exact String Matching Algorithm and Its Applications
String matching is one of most challenging issues in computer science. In this study, a new efficient hybrid string matching algorithm called Atheer was developed. This proposed algorithm is integrated with the excellent properties of three algorithms, namely, the Karp–Rabin, Raita, and Smith algorithms. The Atheer algorithm demonstrated an efficient performance in the number of comparison atte...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملEfficient Wu Manber String Matching Algorithm for Large Number of Patterns
String matching is one of the most important concept used in computer science in various real life applications like as Intrusion detection system, Data mining, Plagiarism detection system. There are many string matching algorithms which help to find pattern from the text. These algorithms are categorized in single string matching and multiple string matching. The Wu-Manber (WM) algorithm is mu...
متن کاملUsing Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested ...
متن کامل